Discrete Event Systems Solution to Exercise Sheet 12 1 Competitive Analysis
نویسندگان
چکیده
In the script there is a definition for the competitiveness of an algorithm. However, this definition only holds if we want to evaluate an algorithm by means of its costs. Sometimes, we want to compare algorithms regarding their benefit rather than their costs. In this case, we have to be a bit careful with the definition of a c-competitive algorithm. We say that an algorithm Alg is c-competitive, if for all finite input sequences the solution of algorithm Alg is at most a factor c worse than the optimal algorithm, regardless of the algorithms being compared concerning costs or benefit. According to whether we evaluate an algorithm based on costs or benefit, an algorithm Alg is c-competitive if for all finite input sequences I
منابع مشابه
Discrete Event Systems Solution to Exercise Sheet 11 1 Competitive Analysis
In the script there is a definition for the competitiveness of an algorithm. However, this definition only holds if we want to evaluate an algorithm by means of its costs. Sometimes, we want to compare algorithms regarding their benefit rather than their costs. In this case, we have to be a bit careful with the definition of a c-competitive algorithm. We say that an algorithm Alg is c-competiti...
متن کاملDiscrete Event Systems Solution to Exercise Sheet 13 1 Competitive Analysis
In the script there is a definition for the competitiveness of an algorithm. However, this definition only holds if we want to evaluate an algorithm by means of its costs. Sometimes, we want to compare algorithms regarding their benefit rather than their costs. In this case, we have to be a bit careful with the definition of a c-competitive algorithm. We say that an algorithm Alg is c-competiti...
متن کاملDiscrete Event Systems Solution to Exercise Sheet 8 1 Competitive Analysis
The competitive analysis of an algorithm Alg consists of two separate steps. First, we show that for an arbitrary problem instance, the result of Alg is asymptotically at most a factor r worse than the the optimal offline result. This yields an upper bound on Alg’s result, that is costAlg ≤ r · costOpt + c. If the task is to show that Alg is constant-competitive for a constant r, then we are do...
متن کاملRecent Developments in Discrete Event Systems
This article is a brief exposure of the process approach to a newly emerging area called "discrete event systems" in control theory and summarizes some of the recent developments in this area. Discrete event systems is an area of research that is developing within the interstices of computer, control and communication sciences. The basic direction of research addresses issues in the analysis an...
متن کامل